Monochromatic connectivity and graph products
نویسندگان
چکیده
منابع مشابه
Colorful monochromatic connectivity
An edge-coloring of a connected graph is monochromatically-connecting if there is a monochromatic path joining any two vertices. How “colorful” can a monochromatically-connecting coloring be? Let mc(G) denote the maximum number of colors used in a monochromatically-connecting coloring of a graph G. We prove some nontrivial upper and lower bounds for mc(G) and relate it to other graph parameters...
متن کاملMixed Connectivity of Cartesian Graph Products and Bundles
An interconnection network should be fault tolerant, because practical communication networks are exposed to failures of network components. Both failures of nodes and failures of connections between them happen and it is desirable that a network is robust in the sense that a limited number of failures does not break down the whole system. A lot of work has been done on various aspects of netwo...
متن کاملMonochromatic Sums Equal to Products in N
Csikvári, Gyarmati, and Sárközy asked whether, whenever the set N of positive integers is finitely colored, there must exist monochromatic a, b, c, and d such that a + b = cd and a �= b. We provide an affirmative answer, showing that a much stronger statement is true.
متن کاملGraph coloring with no large monochromatic components
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having more than m vertices. Let F be any nontrivial minor-closed family of graphs. We show that mcc2(G) = O(n ) for any n-vertex graph G ∈ F . This bound is asymptotically optimal and it is attained for planar graphs. More g...
متن کاملPlanar graph coloring avoiding monochromatic subgraphs: trees
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem. We present a complete picture for the case with a single forbidden connected (induced or noninduced) subgraph. The 2-coloring problem is NP-hard if the forbidde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics, Algorithms and Applications
سال: 2016
ISSN: 1793-8309,1793-8317
DOI: 10.1142/s1793830916500117